A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem
نویسندگان
چکیده
The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution quality. We find provably optimal results for previously unsolved problem instances. The distributed variant using epidemic algorithms allows to find solutions of quality comparable to the MA in less real-time.
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملDistributed Routing and Wavelength Assignment Algorithms for Dynamic WDM All-optical Networks
The problem of establishing lightpath between a given source-destination pair through routing and assigning wavelength to the route is known as routing and wavelength assignment (RWA) problem. In this paper, we have proposed a set of distributed algorithms for dynamic RWA problem in WDM All-optical networks. We have made a comparative study of different distributed algorithms in terms of blocki...
متن کامل